Gaussian queues in the heavy/light-traffic regime
نویسنده
چکیده
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments and variance function σ X(·), equipped with a deterministic drift c > 0, reflected at 0: Q (c) X (t) = sup −∞<s≤t (X(t)−X(s)− c(t− s)). We study the resulting stationary workload processQ (c) X ≡ {Q (c) X (t) : t ≥ 0} in the limiting regimes c→ 0 (heavy traffic) and c→∞ (light traffic). The primary contribution is that we show for both limiting regimes that, under mild regularity conditions on the variance function, there exists a normalizing function δ(c) such thatQ (c) X (δ(c)·)/σX(δ(c)) converges to a non-trivial limit in C[0,∞).
منابع مشابه
SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملGaussian queues in light and heavy traffic
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. Let Q X ≡ {Q X (t) : t ≥ 0} denote a stationary buffer content process for a fluid queue fed by the centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments, X(0) = 0, continuous sample paths and variance function σ 2(·). The system is drained at a constant rate c > 0, so that for a...
متن کاملApproximations for Heavily-Loaded G/GI/n +GI Queues
Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady-state performance of heavily-loaded G/GI/n+GI multi-server queues, which can have non-Poisson and non-renewal arrivals and non-exponential service-time and patience-time distributions. The formulas are based on recently established Gaussian manyserver heavy-traffic limits, but invol...
متن کاملA New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...
متن کاملHeavy Traffic Limits for Queues with Many Deterministic Servers
Consider a sequence of stationary GI/D/N queues indexed by N ↑ ∞, with servers’ utilization 1 − β/√N , β > 0. For such queues we show that the scaled waiting times NWN converge to the (finite) supremum of a Gaussian random walk with drift −β. This further implies a corresponding limit for the number of customers in the system, an easily computable non-degenerate limiting delay probability in te...
متن کامل